Complexity of Embedded Chain Algorithm for Computing steady State Probabilities of Markov Chain
نویسندگان
چکیده
The paper presents the theoretical evaluation of the complexity of an algorithm, based on embedded Markov chains, for computing steady state probabilities. Experimental research with different infinitesimal generator matrices was performed to support theoretical evaluations. Results showed that modified algorithm can be more effective for sparse matrices. An example of a queuing system is presented to demonstrate the automatic creation of the model of the system based on the proposed modelling method.
منابع مشابه
On the Generality of Binary Tree-like Markov Chains
In this paper we show that an arbitrary tree-like Markov chain can be embedded in a binary tree-like Markov chain with a special structure. When combined with [7], this implies that any tree structured QBD Markov chain can be reduced to a binary tree-like process. Furthermore, a simple relationship between the V , Rs and Gs matrices of the original and the binary tree-like Markov chain is estab...
متن کاملAnalysis of deterministic and stochastic Petri nets
We present a time and space efficient algorithm for computing steady state solutions of deterministic and stochastic Petri nets (DSPNs) with both stochastic and structural extensions. The algorithm can deal with different execution policies associated with deterministic transitions of a DSPN. The definition of a subordinated Markov chain (SMC) is refined to reduce the computational cost of deri...
متن کاملA Queuing Model with Markovian Arrival and LCFS Priority System and General Time for Service
We consider a single server queuing system with repeated attempts in which customers arrive according a Markov arrival process (MAP) and with a LCFS PR discipline. The service times are independent and have a common general distribution. After service completion time the server initiates his search time with an arbitrary distribution function. We consider two cases where the maximum number of r...
متن کاملCompositional Calculation of Steady - StateProbabilities ?
We describe a method for converting the problem of computing steady-state probabilities of a continuous-time Markov chain into the problem of computing absorption probabilities for a related chain. The construction enables us to apply compositional techniques for computing absorption probabilities that we have previously developed for probabilistic I/O automata to be used for computing certain ...
متن کاملMarkov Chain Anticipation for the Online Traveling Salesman Problem by Simulated Annealing Algorithm
The arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. The policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. In on-line created tours arc costs are not available for decision makers. The on-line traversed nodes are f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITC
دوره 40 شماره
صفحات -
تاریخ انتشار 2011